An Improved Algorithm for Minimizing Makespan on Flowshops with Uncertain Processing Times
نویسندگان
چکیده
We address the four-machine flowshop scheduling problem with objective of minimizing makespan uncertain processing times The was addressed in literature (RAIRO Operations Research 54, 529-553) and different algorithms were proposed. In this paper, we propose a new algorithm for problem. proposed is compared best by using extensive computational experiments. Computational experiments indicate that performs much better than terms error while both have same time. Specifically, reduces existing over 40%. This result has been confirmed tests hypotheses significance level 0.01.
منابع مشابه
Minimizing Makespan in Flowshops with Bounded Processing Times
CT : The two-machine flowshop scheduling problem of minimizing makespan is addressed where jobs have rocessing times which are bounded within certain intervals. The probability distributions of job processing hin intervals are not known. The only known information about job processing times is the lower and upper he decision about a solution of the problem, i.e., finding a sequence, has to be m...
متن کاملMinimizing makespan in hybrid flowshops
We consider flowshop environments that consist of multiple stages and multiple machines in each stage. The flowshops are flexible in the sense that a task within a stage can be processed by any of the machines in the stage. We refer to this design as the hybrid flowshop. Our objective is to schedule a set of n jobs so as to minimize makespan. The problem is NP-complete even in the case of a sin...
متن کاملMinimizing Makespan in Flowshops with Pallet Requirements
We treat the problem of scheduling a owshop with pallet requirements. Each job in the owshop needs a pallet the entire time, from the start of its rst operation until the completion of the last operation, and the number of pallets in the shop at any given time is limited by an integer K. We prove that the problem is NP-hard in the strong sense for m 2 and K 3, and for m 3 and K 2, where m is th...
متن کاملMinimizing Mean Completion Time in Flowshops with Random Processing Times
RACT : We consider the two-machine flowshop scheduling problem where jobs have random processing times are bounded within certain intervals. The objective is to minimize total completion time of all jobs. The decision of a solution for the problem has to be made based on the lower and upper bounds on job processing times since this only information available. The problem is NP-hard since the sp...
متن کاملMinimizing makespan with release times on identical parallel batching machines
We consider the problem of scheduling n jobs onm identical parallel batching machines. Each job is characterized by a release time and a processing time. Each machine can process up to B (B < n ) jobs as a batch simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. The objective is to minimize the maximum completion time (makespan). ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Uluslararas? mühendislik ara?t?rma ve geli?tirme dergisi
سال: 2021
ISSN: ['1308-5506', '1308-5514']
DOI: https://doi.org/10.29137/umagd.887624